A Proof of the Mullineux Conjecture

نویسندگان

  • BEN FORD
  • ALEXANDER S. KLESHCHEV
  • Brian Hartley
چکیده

A partition λ of a positive integer n is a sequence λ1 λ2 λm 0 of integers such that ∑λi n. For a positive integer p, a partition λ λ1 λ2 λm (or its Young diagram) is called p-regular if it does not have p or more equal parts, i.e. if there does not exist t m p 1 with λt λt 1 λt p 1. Let F be a field of characteristic p 0. It is well known that irreducible representations of the symmetric group Sn over F are naturally parametrized by pregular partitions of n (cf. for example [9, 12]). If λ is such a partition we denote the corresponding irreducible module by Dλ. Let sgnn be the one-dimensional sign representation of Sn over F; i.e., sgnn F as a vector space and g f sgn g f for any g Sn f F . Here sgn g is just the sign of the permutation g. It is clear that for any irreducible Dλ, the tensor product Dλ sgnn is also irreducible. The problem, usually called the problem of Mullineux, is to find the p-regular partition μ such that Dλ sgnn D μ. Put Dλ sgnn D bn λ In this way a bijection bn on the set Pn of p-regular partitions of n is defined for each positive integer n, and the problem is:

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On Residue Symbols and the Mullineux Conjecture

This paper is concerned with properties of the Mullineux map, which plays a rôle in p-modular representation theory of symmetric groups. We introduce the residue symbol for a p-regular partitions, a variation of the Mullineux symbol, which makes the detection and removal of good nodes (as introduced by Kleshchev) in the partition easy to describe. Applications of this idea include a short proof...

متن کامل

m at h . G R / 0 21 01 08 v 1 7 O ct 2 00 2 A NEW PROOF OF THE MULLINEUX CONJECTURE

Let Sn be the symmetric group on n letters, k be a field of characteristic p and D be the irreducible kSn-module corresponding to a p-regular partition λ of n, as in [12]. By tensoring D with the 1-dimensional sign representation we obtain another irreducible kSn-module. If p = 0, D λ ⊗ sgn ∼= D ′ , where λ′ is the conjugate of the partition λ, and if p = 2, we obviously have that D ⊗ sgn ∼= D....

متن کامل

A short proof of the maximum conjecture in CR dimension one

In this paper and by means of the extant results in the Tanaka theory, we present a very short proof in the specific case of CR dimension one for Beloshapka's maximum conjecture. Accordingly, we prove that each totally nondegenerate model of CR dimension one and length >= 3 has rigidity. As a result, we observe that the group of CR automorphisms associated with each of such models contains onl...

متن کامل

On the Closed-Form Solution of a Nonlinear Difference Equation and Another Proof to Sroysang’s Conjecture

The purpose of this paper is twofold. First we derive theoretically, using appropriate transformation on x(n), the closed-form solution of the nonlinear difference equation x(n+1) = 1/(±1 + x(n)), n ∈ N_0. The form of solution of this equation, however, was first obtained in [10] but through induction principle. Then, with the solution of the above equation at hand, we prove a case ...

متن کامل

On the oriented perfect path double cover conjecture

‎An  oriented perfect path double cover (OPPDC) of a‎ ‎graph $G$ is a collection of directed paths in the symmetric‎ ‎orientation $G_s$ of‎ ‎$G$ such that‎ ‎each arc‎ ‎of $G_s$ lies in exactly one of the paths and each‎ ‎vertex of $G$ appears just once as a beginning and just once as an‎ ‎end of a path‎. ‎Maxov{'a} and Ne{v{s}}et{v{r}}il (Discrete‎ ‎Math‎. ‎276 (2004) 287-294) conjectured that ...

متن کامل

Partial proof of Graham Higman's conjecture related to coset diagrams

Graham Higman has defined coset diagrams for PSL(2,ℤ). These diagrams are composed of fragments, and the fragments are further composed of two or more circuits. Q. Mushtaq has proved in 1983 that existence of a certain fragment γ of a coset diagram in a coset diagram is a polynomial f in ℤ[z]. Higman has conjectured that, the polynomials related to the fragments are monic and for a fixed degree...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1997